A Simulated Annealing Algorithm for Progressive Mesh Optimization

This paper presents a novel progressive mesh model based on collapse tree, which can accomplish the disordered expansions and collapses of the simplified mesh and is able to restore the mesh just in a specific area. With arbitrary collapse and expansion, we design an edge collapse algorithm for mesh optimization. Its summary process can be described as follows: generating a series of new simplified meshes through the two operations from the original mesh, meanwhile, controlling the process by simulated annealing algorithm to optimize the mesh constantly, looking forward to a better simplified mesh on global scale.